Parallel Mean Shift for Interactive Volume Segmentation
نویسندگان
چکیده
In this paper we present a parallel dynamic mean shift algorithm based on path transmission for medical volume data segmentation. The algorithm first translates the volume data into a joint position-color feature space subdivided uniformly by bandwidths, and then clusters points in feature space in parallel by iteratively finding its peak point. Over iterations it improves the convergent rate by dynamically updating data points via path transmission and reduces the amount of data points by collapsing overlapping points into one point. The GPU implementation of the algorithm can segment 256x256x256 volume in 6 seconds using an NVIDIA GeForce 8800 GTX card for interactive processing, which is hundreds times faster than its CPU implementation. We also introduce an interactive interface to segment volume data based on this GPU implementation. This interface not only provides the user with the capability to specify segmentation resolution, but also allows the user to operate on the segmented tissues and create desired visualization results.
منابع مشابه
Convex Optimization Project Report: Mode Seeking with Convex Shift and Interactive Learning
We give a brief introduction of nonparametric density estimation and the family of mode seeking methods under this framework. Regarding the limit of current methods, we propose several improvements. Specifically, we look into a mode seeking method called the Mean Shift, whose paper was published on IEEE Trans. Pattern Anal. Mach. Intell. 2002 and is the major reference paper we are targeting to...
متن کاملImage Segmentation by using Mean-Shift with Dynamic Region Merging - A Survey
Image segmentation is to classify or cluster an image into several parts (regions) according to the feature of image. This paper presents a survey of different image segmentation techniques. Efficient and effective image segmentation is an important task in computer vision and object recognition. Since fully automatic image segmentation is usually very hard for natural images, interactive schem...
متن کاملAn Efficient Interactive Image Segmentation by Maximal Similarity Based Region Merging With Artificial Neural Networks for MRI Medical Images
In computer vision effective image segmentation and object recognition are an important task. This paper presents a new region merging based interactive image segmentation method. Since fully automatic image segmentation is usually very hard for natural images, interactive schemes with a few simple user inputs are good solutions. The main objective of the present work is to provide a new approa...
متن کاملA Parallel Annealing Method For Automatic Color Cervigram Image Segmentation
The accurate and automatic segmentation of tissue regions in cervigram images can aid in the identification and classification of precancerous regions. We implement and analyze four GPU (Graphics Processing Unit) based clustering algorithms: K-means, mean shift, deterministic annealing, and spatially coherent deterministic annealing. From our results, we propose a novel parallel algorithm using...
متن کاملHigh-resolution image segmentation using fully parallel mean shift
In this paper, we present a fast and effective method of image segmentation. Our design follows the bottom-up approach: first, the image is decomposed by nonparametric clustering; then, similar classes are joined by a merging algorithm that uses color, and adjacency information to obtain consistent image content. The core of the segmenter is a parallel version of the mean shift algorithm that w...
متن کامل